Dual mixed volumes and the slicing problem

Dual Mixed Volumes and the Slicing Problem

We develop a technique using dual mixed-volumes to study the isotropic constants of some classes of spaces. In particular, we recover, strengthen and generalize results of Ball and Junge concerning the isotropic constants of subspaces and quotients of Lp and related spaces. An extension of these results to negative values of p is also obtained, using generalized intersection-bodies. In particul...

Star Valuations and Dual Mixed Volumes

Since its creation by Brunn and Minkowski, what has become known as the Brunn Minkowski theory has provided powerful machinery to solve a broad variety of inverse problems with stereological data. The machinery of the Brunn Minkowski theory includes mixed volumes (of Minkowski), symmetrization techniques (such as those of Steiner and Blaschke), isoperimetric inequalities (such as the Brunn Mink...

Slicing Problem

Computing Mixed Discriminants , Mixed Volumes

We construct a probabilistic polynomial time algorithm that computes the mixed discriminant of given n positive definite n × n matrices within a 2O(n) factor. As a corollary, we show that the permanent of an n×n nonnegative matrix and the mixed volume of n ellipsoids inRn can be computed within a 2O(n) factor by probabilistic polynomial time algorithms. Since every convex body can be approximat...

The Hypergeometric Coupon Collection Problem and its Dual

Suppose an urn contains M balls, of different types, which are removed from the urn in a uniform random manner. In the hypergeometric coupon collection problem, we are interested in the set of balls that have been removed at the moment when at least one ball of each type has been removed. In its dual, we are interested in the set of removed balls at the first moment that this set contains all o...